Order and quasiperiodicity in episturmian words

نویسنده

  • Amy Glen
چکیده

In this paper, we build upon previous work concerning inequalities characterizing Sturmian and episturmian words – see [19, 29, 30, 14, 16]. First let us recall from [29] the following notion relating to lexicographic order. Let A be a totally ordered finite alphabet consisting of at least two letters. To any infinite word x over A, we can associate two infinite words min(x) and max(x) such that any prefix of min(x) (resp. max(x)) is the lexicographically smallest (resp. greatest) amongst the factors of x of the same length. More precisely, if we denote by min(x|k) (resp. max(x|k)) the lexicographically smallest (resp. greatest) factor of x of length k for the given order, then min(x|k) and max(x|k) are clearly prefixes of the respective words min(x|k + 1) and max(x|k + 1). So we can define, by taking limits, the following two infinite words

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasiperiodic and Lyndon episturmian words

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in term...

متن کامل

Pseudopalindrome closure operators in free monoids

We consider involutory antimorphisms θ of a free monoid A∗ and their fixed points, called θ-palindromes or pseudopalindromes. A θ-palindrome reduces to a usual palindrome when θ is the reversal operator. For any word w ∈ A∗ the right (resp. left) θ-palindrome closure of w is the shortest θ-palindrome having w as a prefix (resp. suffix). We prove some results relating θ-palindrome closure operat...

متن کامل

Characterizations of finite and infinite episturmian words via lexicographic orderings

In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a wide sense (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we character...

متن کامل

Sturmian and Episturmian Words (A Survey of Some Recent Results)

This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the Burrows-Wheeler transform behaves on Sturmian words. We mention results on balanced epi...

متن کامل

Characteristic morphisms of generalized episturmian words

In a recent paper with L. Q. Zamboni, the authors introduced the class of θ-episturmian words. An infinite word over A is standard θepisturmian, where θ is an involutory antimorphism of A∗, if its set of factors is closed under θ and its left special factors are prefixes. When θ is the reversal operator, one obtains the usual standard episturmian words. In this paper, we introduce and study θ-c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007